منابع مشابه
$L-$ordered Fuzzifying Convergence Spaces
Based on a complete Heyting algebra, we modify the definition oflattice-valued fuzzifying convergence space using fuzzy inclusionorder and construct in this way a Cartesian-closed category, calledthe category of $L-$ordered fuzzifying convergence spaces, in whichthe category of $L-$fuzzifying topological spaces can be embedded.In addition, two new categories are introduced, which are called the...
متن کاملOrdered Probability Algebra ?
In this paper, the feasibility of using nite totally ordered probability models under Aleliunas's Theory of Probabilistic Logic Aleliunas, 1988] is investigated. The general form of the probability algebra of these models is derived and the number of possible algebras with given size is deduced. Based on this analysis, we discuss problems of denominator-indiierence and ambiguity-generation that...
متن کاملOrdered Probability Mass Function
Suppose that in the four tests Alice’s scores are 90, 95, 85, 90, and Bob’s scores are 85, 95, 90, 90. How to evaluate their scores? In this paper, we introduce the concept of ordered probability mass function which can be used to find a probability mass function with smaller variance. More interestingly, we can use it to distinguish sequences of positive numbers statistically.
متن کاملCleavability in Ordered Spaces
In this paper we study the role of cleavability and divisibility in the topology of generalized ordered (GO-)spaces. We characterize cleavability of a GOspace over the class of metrizable spaces, and over the spaces of irrational and rational numbers. We present a series of examples related to characterizations of cleavability over separable metric spaces and over the space of real numbers.
متن کاملTopology Notes: Ordered Spaces
Consider the following properties of a binary relation ≤ on a set X: (Reflexivity) For all x ∈ X, x ≤ x. (Anti-Symmetry) For all x, y ∈ X, if x ≤ y and y ≤ x, then x = y. (Transitivity) For all x, y, z ∈ X, if x ≤ y and y ≤ z, then x ≤ z. (Totality) For all x, y ∈ X, either x ≤ y or y ≤ x. A relation which satisfies reflexivity and transitivity is called a quasi-ordering. A relation which satis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2017
ISSN: 0022-247X
DOI: 10.1016/j.jmaa.2017.05.046